Degree-associated edge-reconstruction numbers of double-brooms
نویسندگان
چکیده
An edge-deleted subgraph of a graph G is an edge-card. A decard consists of an edge-card and the degree of the missing edge. The degree-associated edge-reconstruction number of a graph G, denoted dern(G), is the minimum number of decards that suffice to reconstruct G. The adversary degree-associated edge-reconstruction number adern(G) is the least k such that every set of k decards determines G. We determine these two parameters for all double-brooms. The answer is usually 1 for dern(G), and 2 for adern(G) when G is double-broom. But there are exceptions in each case.
منابع مشابه
The adversary degree-associated reconstruction number of double-brooms
A vertex-deleted subgraph of a graph G is a card. A dacard specifies the degree of the deleted vertex along with the card. The adversary degree-associated reconstruction number adrn(G) is the least k such that every set of k dacards determines G. We determine adrn(Dm,n,p), where the double-broom Dm,n,p with p ≥ 2 is the tree with m + n + p vertices obtained from a path with p vertices by append...
متن کاملOn Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
متن کاملEdge Artifacts in Point Spread Function-based PET Reconstruction in Relation to Object Size and Reconstruction Parameters
Objective(s): We evaluated edge artifacts in relation to phantom diameter and reconstruction parameters in point spread function (PSF)-based positron emission tomography (PET) image reconstruction.Methods: PET data were acquired from an original cone-shaped phantom filled with 18F solution (21.9 kBq/mL) for 10 min using a Biograph mCT scanner. The images were reconstructed using the baseline or...
متن کاملGraph Reconstruction - Some New Developments
The reconstruction conjecture claims that every graph on at least three vertices is uniquely determined by its collection of vertex deleted subgraphs. Even though it is one of the foremost unsolved problems in Graph Theory, work on it has slowed down, may be due to the general feeling that existing techniques are not likely to lead to a complete solution. Here we give the results that have appe...
متن کاملAbsolute algebraic connectivity of double brooms
We use a geometric technique based on embeddings of graphs to provide an explicit formula for the absolute algebraic connectivity and its eigenvectors of double brooms.
متن کامل